Partitioning Random Graphs into Monochromatic Components
نویسندگان
چکیده
Erdős, Gyárfás, and Pyber (1991) conjectured that every r-colored complete graph can be partitioned into at most r − 1 monochromatic components; this is a strengthening of a conjecture of Lovász (1975) and Ryser (1970) in which the components are only required to form a cover. An important partial result of Haxell and Kohayakawa (1995) shows that a partition into r monochromatic components is possible for sufficiently large r-colored complete graphs. We start by extending Haxell and Kohayakawa’s result to graphs with large minimum degree, then we provide some partial analogs of their result for random graphs. In particular, we show that if p > ( 27 logn n )1/3 , then a.a.s. in every 2coloring of G(n, p) there exists a partition into two monochromatic components, and for r > 2 if p ( r logn n )1/r , then a.a.s. there exists an r-coloring of G(n, p) such that there does not exist a cover with a bounded number of components. Finally, we consider a random graph version of a classic result of Gyárfás (1977) about large monochromatic components in r-colored complete graphs. We show that if p = ω(1) n , then a.a.s. in every r-coloring of G(n, p) there exists a monochromatic component of order at least (1− o(1)) n r−1 .
منابع مشابه
Partitioning 2-Edge-Colored Ore-Type Graphs by Monochromatic Cycles
Consider a graph G on n vertices satisfying the following Ore-type condition: for any two non-adjacent vertices x and y of G, we have deg(x)+deg(y) > 3n/2. We conjecture that if we color the edges of G with 2 colors then the vertex set of G can be partitioned to two vertex disjoint monochromatic cycles of distinct colors. In this paper we prove an asymptotic version of this conjecture. 1 Backgr...
متن کاملPartition of Graphs and Hypergraphs into Monochromatic Connected Parts
We show that two results on covering of edge colored graphs by monochromatic connected parts can be extended to partitioning. We prove that for any 2-edgecolored non-trivial r-uniform hypergraph H, the vertex set can be partitioned into at most α(H)− r+ 2 monochromatic connected parts, where α(H) is the maximum size of a set of vertices that does not contain any edge. In particular, any 2-edgec...
متن کاملPartitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees
In this paper we consider the problem of partitioning complete multipartite graphs with edges colored by 2 colors into the minimum number of vertex disjoint monochromatic cycles, paths and trees, respectively. For general graphs we simply address the decision version of these three problems the 2-PGMC, 2-PGMP and 2-PGMT problems, respectively. We show that both 2-PGMC and 2-PGMP problems are NP...
متن کاملPartitioning 3-Colored Complete Graphs into Three Monochromatic Cycles
We show in this paper that in every 3-coloring of the edges of K all but o(n) of its vertices can be partitioned into three monochromatic cycles. From this, using our earlier results, actually it follows that we can partition all the vertices into at most 17 monochromatic cycles, improving the best known bounds. If the colors of the three monochromatic cycles must be different then one can cove...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 24 شماره
صفحات -
تاریخ انتشار 2017